An Explicit Construction of Quantum Expanders
نویسنده
چکیده
Quantum expanders are a natural generalization of classical expanders. These objects were introduced and studied by [1, 3, 4]. In this note we show how to construct explicit, constant-degree quantum expanders. The construction is essentially the classical Zig-Zag expander construction of [5], applied to quantum expanders.
منابع مشابه
Quantum margulis expanders
Received (received date) Revised (revised date) We present a simple way to quantize the well-known Margulis expander map. The result is a quantum expander which acts on discrete Wigner functions in the same way the classical Margulis expander acts on probability distributions. The quantum version shares all essential properties of the classical counterpart, e.g., it has the same degree and spec...
متن کاملQuantum expanders and the quantum entropy difference problem
Classical expanders and extractors have numerous applications in computer science. However, it seems these classical objects have no meaningful quantum generalization. This is because it is easy to generate entropy in quantum computation simply by tracing out registers. In this paper we define quantum expanders and extractors in a natural way. We show that this definition is exactly what is nee...
متن کاملExplicit Unique-Neighbor Expanders
We present a simple, explicit construction of an infinite family F of bounded-degree ’unique-neighbor’ expanders Γ; i.e., there are strictly positive constants α and , such that all Γ = (X,E(Γ)) ∈ F satisfy the following property. For each subset S of X with no more than α|X| vertices, there are at least |S| vertices in X \ S that are adjacent in Γ to exactly one vertex in S. The construction o...
متن کاملEfficient Quantum Tensor Product Expanders and k-Designs
We give an efficient construction of constant-degree, constant-gap quantum k-tensor product expanders. The key ingredients are an efficient classical tensor product expander and the quantum Fourier transform. Our construction works whenever k = O(n/ logn), where n is the number of qubits. An immediate corollary of this result is an efficient construction of approximate unitary k-designs on n qu...
متن کاملEigenvalues, Expanders and Superconcentrators
Explicit construction of families of linear expanders and superconcentrators is relevant to theoretical computer science in several ways. There is essentially only one known explicit construction. Here we show a correspondence between the eigenvalues of the adjacency matrix of a graph and its expansion properties, and combine it with results on Group Representations to obtain many new examples ...
متن کامل